A Note on Anti-Berge Equilibrium for Bimatrix Game

Game theory plays an important role in applied mathematics, economics and decision theory. There are many works devoted to game Most of them deals with a Nash equilibrium. A global search algorithm for finding equilibrium was proposed [13]. Also, the extraproximal extragradient algorithms have been discussed [3]. Berge is model cooperation social dilemmas, including Prisoner’s Dilemma games [15]. The concept introduced by French mathematician Claude [5] coalition games. first research were conducted Vaisman Zhukovskiy [18; 19]. method constructing which Pareto-maximal respect all other equilibriums has examined [10]. studied [16] from view point differential Abalo Kostreva [1; 2] proved existence theorems pure-strategy strategic-form Nessah [11] Larbani, Tazdait [12] provided new theorem. Applications science [6; 17]. work [7] application economics. Connection shown [17]. recently, Enkhbat Batbileg [14] Bimatrix its nonconvex optimization reduction. In this paper, inspired equilibriums, we introduce notion so-called Anti-Berge main goal paper examine bimatrix game. organized as follows. Section 2 mixed strategies. 3, formulation formulated.